Randomized rounding

Results: 58



#Item
11Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne,

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
12The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T.  SODA 2012

The Entropy Rounding Method in Approximation Algorithms Thomas Rothvoß Department of Mathematics, M.I.T. SODA 2012

Add to Reading List

Source URL: www.math.washington.edu

Language: English - Date: 2013-11-01 17:11:36
13CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,

CS264: Beyond Worst-Case Analysis Lecture #8: Exact Recovery in Stable Cut Instances∗ Tim Roughgarden† October 15,

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-11-05 01:13:23
14Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Algorithms as Mechanisms: The Price of Anarchy of Relax-and-Round ¨ PAUL DUTTING, ETH Z¨ urich

Add to Reading List

Source URL: paulduetting.com

Language: English - Date: 2015-12-11 02:28:02
15From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡

Add to Reading List

Source URL: www-bcf.usc.edu

Language: English - Date: 2011-10-07 01:19:59
16Interference in Cellular Networks: The Minimum Membership Set Cover Problem Fabian Kuhn1 , Pascal von Rickenbach1 , Roger Wattenhofer1 , Emo Welzl2 , and Aaron Zollinger1 , , watt

Interference in Cellular Networks: The Minimum Membership Set Cover Problem Fabian Kuhn1 , Pascal von Rickenbach1 , Roger Wattenhofer1 , Emo Welzl2 , and Aaron Zollinger1 , , watt

Add to Reading List

Source URL: disco.ethz.ch

Language: English - Date: 2014-09-26 08:36:32
17Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a  Max-Planck-Institut f¨

Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a Max-Planck-Institut f¨

Add to Reading List

Source URL: www.numerik.uni-kiel.de

Language: English - Date: 2010-04-08 11:28:07
18Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples Benjamin Doerr, Michael Gnewuch, and Magnus Wahlstr¨om  Abstract In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Mo

Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples Benjamin Doerr, Michael Gnewuch, and Magnus Wahlstr¨om Abstract In [B. Doerr, M. Gnewuch, P. Kritzer, F. Pillichshammer. Mo

Add to Reading List

Source URL: www.numerik.uni-kiel.de

Language: English - Date: 2009-06-23 07:05:42
19A Randomized Rounding Approach to the Traveling Salesman Problem Shayan Oveis Gharan ∗

A Randomized Rounding Approach to the Traveling Salesman Problem Shayan Oveis Gharan ∗

Add to Reading List

Source URL: www.stanford.edu

Language: English